The Residues Modulo M Of Products Of Random Integers
نویسنده
چکیده
For two (possibly stochastically dependent) random variables X and Y taking values in {O, ... , m 1} we study the distribution of the random residue U = XY mod m. In the case of independent and uniformly distributed X and Y we provide an exact solution in terms of generating functions that are computed via p-adic analysis. We show also that in the uniform case it is stochastically smaller than (and very close to) the uniform distribution. For general dependent X and Y we prove an inequality for the distance sUPxE[O,l] lFu(x) xl.
منابع مشابه
Graphical patterns in quadratic residues
Plots of quadratic residues display some visual features that are analyzed mathematically in this paper. The graphical patterns of quadratic residues modulo m depend only on the residues of m modulo the lowest positive integers.
متن کاملar X iv : m at h / 04 06 24 5 v 2 [ m at h . N T ] 1 4 M ar 2 00 5 1 Graphical patterns in quadratic residues
Plots of quadratic residues display some visual features that are analyzed mathematically in this paper. The graphical patterns of quadratic residues modulo m depend only on the residues of m modulo the lowest positive integers.
متن کاملA Congruence for Products of Binomial Coefficients modulo a Composite
For a positive composite integer n, we investigate the residues of ( mn k ) for positive integers m and k. First, we discuss divisibility of such coefficients. Then we study congruence identities relating products of binomial coefficients modulo n. Certainly the Chinese Remainder Theorem can be used in combination with prime power results to evaluate binomial coefficients modulo a composite. Ho...
متن کاملM ay 2 01 1 Geometric configurations in the ring of integers modulo pl
We study variants of the Erd˝ os distance problem and the dot products problem in the setting of the integers modulo q, where q = p is a power of an odd prime.
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 11 شماره
صفحات -
تاریخ انتشار 2002